Analyzing Expected Outcomes and Almost-Sure Termination of Probabilistic Programs is Hard
نویسندگان
چکیده
This paper considers the computational hardness of computing expected outcomes and deciding almost–sure termination of probabilistic programs. We show that deciding almost–sure termination and deciding whether the expected outcome of a program equals a given rational value is Π2–complete. Computing lower and upper bounds on the expected outcome is shown to be recursively enumerable and Σ2–complete, respectively.
منابع مشابه
Analyzing Expected Outcomes and (Positive) Almost–Sure Termination of Probabilistic Programs is Hard
Probabilistic programs [1] are imperative sequential programs with the ability to toss a biased coin and proceed their computations depending on the outcome of the coin toss. They are used in security to describe cryptographic constructions (such as randomized encryption) and security experiments [2], in machine learning to describe distribution functions that are analyzed using Bayesian infere...
متن کاملOn the Hardness of Almost-Sure Termination
This paper considers the computational hardness of computing expected outcomes and deciding (universal) (positive) almost–sure termination of probabilistic programs. It is shown that computing lower and upper bounds of expected outcomes is Σ 1– and Σ 0 2–complete, respectively. Deciding (universal) almost–sure termination as well as deciding whether the expected outcome of a program equals a gi...
متن کاملTermination of Nondeterministic Recursive Probabilistic Programs
We study the termination problem for nondeterministic recursive probabilistic programs. First, we show that a ranking-supermartingales-based approach is both sound and complete for bounded terminiation (i.e., bounded expected termination time over all schedulers). Our result also clarifies previous results which claimed that ranking supermartingales are not a complete approach even for nondeter...
متن کاملBeyond Almost-Sure Termination
The aim of this paper is to argue that models in cognitive science based on probabilistic computation should not be restricted to those procedures that almost surely (with probability 1) terminate. There are several reasons to consider nonterminating procedures as candidate components of cognitive models. One theoretical reason is that there is a perfect correspondence between the enumerable se...
متن کاملProbabilistic Program Analysis with Martingales
We present techniques for the analysis of infinite state probabilistic programs to synthesize probabilistic invariants and prove almost-sure termination. Our analysis is based on the notion of (super) martingales from probability theory. First, we define the concept of (super) martingales for loops in probabilistic programs. Next, we present the use of concentration of measure inequalities to b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1410.7225 شماره
صفحات -
تاریخ انتشار 2014